|
課程名稱 |
演算法
Algorithms |
|
開課學期 |
112-1 |
|
授課對象 |
管理學院 資訊管理學系 |
|
授課教師 |
蔡益坤 |
|
課號 |
IM2009 |
|
課程識別碼 |
705E22200 |
|
班次 |
|
|
學分 |
3.0 |
|
全/半年 |
半年 |
|
必/選修 |
必帶 |
|
上課時間 |
星期二7,8,9(14:20~17:20) |
|
上課地點 |
管二305 |
|
備註 |
本課程以英語授課。部分週次之週二6有實習，地點同上課教室。
總人數上限：70人
外系人數限制：6人 |
|
|
|
|
課程簡介影片 |
|
|
核心能力關聯 |
核心能力與課程規劃關聯圖 |
|
課程大綱
|
|
為確保您我的權利,請尊重智慧財產權及不得非法影印
|
|
課程概述 |
This course provides an introduction to the design and analysis of computer algorithms, with a particular emphasis on the use of principles of mathematical induction in designing algorithms. We will try to cover most of Manber's book plus supplementary material, including a few chapters of the book by Cormen et al. |
|
課程目標 |
The goal of this course is to acquaint the students with basic computer algorithms and their design principles and to cultivate the students' ability in designing and analyzing algorithms independently. |
|
課程要求 |
The students are assumed to have taken Computer Programming and Data Structures.
There will be two exams and ten homework assignments or quizzes.
Class participation will also be taken into account in grading. |
|
預期每週課後學習時數 |
|
|
Office Hours |
每週三 13:30~14:00
每週二 13:30~14:00 備註： Or by appointment, Room 1108, Management Building 2. |
|
指定閱讀 |
|
|
參考書目 |
1. Computer Algorithms / C++, Second Edition, E. Horowitz, S. Sahni, and S. Rajasekaran, Computer Science Press, 2007.
2. Algorithms in C, Third Edition: Parts 1--5, R. Sedgewick, Addison-Wesley, 2001. |
|
評量方式
(僅供參考) |
|
|
針對學生困難提供學生調整方式 |
|
上課形式 |
以錄音輔助 |
|
作業繳交方式 |
延長作業繳交期限 |
|
考試形式 |
延後期末考試日期(時間) |
|
其他 |
由師生雙方議定 |
|
|
週次 |
日期 |
單元主題 |
|
Week 1 |
9/5 |
Introduction; Mathematical Induction |
|
Week 2 |
9/12 |
Mathematical Induction |
|
Week 3 |
9/19 |
Analysis of Algorithms |
|
Week 4 |
9/26 |
Design by Induction |
|
Week 5 |
10/3 |
Data Structures: A Supplement; Searching and Sorting |
|
Week 6 |
10/10 |
Holiday, no class meeting |
|
Week 7 |
10/17 |
Searching and Sorting |
|
Week 8 |
10/24 |
String Processing |
|
Week 9 |
10/31 |
Midterm exam |
|
Week 10 |
11/7 |
Graph Algorithms: Basic |
|
Week 11 |
11/14 |
Graph Algorithms: Basic; Graph Algorithms: Advanced |
|
Week 12 |
11/21 |
Graph Algorithms: Advanced |
|
Week 13 |
11/28 |
Dynamic Programming |
|
Week 14 |
12/5 |
Reduction; NP-Completeness |
|
Week 15 |
12/12 |
NP-Completeness |
|
Week 16 |
12/19 |
Final exam |
|